A Partitioning Scheme for Big Dynamic Trees
نویسندگان
چکیده
In this paper, we propose a scheme for partitioning dynamically growing big trees and its implementation. The scheme is based on the historypattern encoding scheme for dynamic multidimensional datasets. Our scheme of handling big dynamic trees is relying on the history-pattern encoding, by which large scale datasets can be treated efficiently. In order to partition these dynamic trees efficiently, the encoding scheme will be improved and adapted to the parti‐ tioning. In our partitioning scheme of a tree T, the path from the T’s root node to the root node of a partitioned subtree, is treated as an index for selecting the subtree. The path is split into a shared path and the local path in the subtree and each path is encoded by using the history-pattern encoding. The partitioning scheme contributes to the reduction of the storage cost and the improvement of the retrieval cost. In this paper, after our tree encoding scheme designed for the partitioning is described, some problems caused in the encoding are addressed and their countermeasure is presented. Finally, an implemented prototype system is described and evaluated.
منابع مشابه
Parallel Rule Mining with Dynamic Data Distribution under Heterogeneous Cluster Environment
Big data mining methods supports knowledge discovery on high scalable, high volume and high velocity data elements. The cloud computing environment provides computational and storage resources for the big data mining process. Hadoop is a widely used parallel and distributed computing platform for big data analysis and manages the homogeneous and heterogeneous computing models. The MapReduce fra...
متن کاملNew Combinatorial Properties and Algorithms for AVL Trees
In this thesis, new properties of AVL trees and a new partitioning of binary search trees named core partitioning scheme are discussed, this scheme is applied to three binary search trees namely AVL trees, weight-balanced trees, and plain binary search trees. We introduce the core partitioning scheme, which maintains a balanced search tree as a dynamic collection of complete balanced binary tre...
متن کاملDynamic Process Partitioning and Migration for Irregular Applications
Many practical applications generate irregular, nonbalanced divide-and-conquer trees which have different depths, possibly also different numbers of successors at different levels. Efficient parallelization is difficult as it requires dynamic partitioning and mapping of such trees to available processors. Irregular applications can obtain unpredictable intermediate results which then affect cre...
متن کاملPlanning and Control of Two-Link Rigid Flexible Manipulators in Dynamic Object Manipulation Missions
This research focuses on proposing an optimal trajectory planning and control method of two link rigid-flexible manipulators (TLRFM) for Dynamic Object Manipulation (DOM) missions. For the first time, achievement of DOM task using a rotating one flexible link robot was taken into account in [20]. The authors do not aim to contribute on either trajectory tracking or vibration control of the End-...
متن کاملParallel adaptive wavelet collocation method for PDEs
a r t i c l e i n f o a b s t r a c t Dynamic load balancing Wavelets Lifting scheme Second generation wavelets Adaptive grid Multiresolution Multilevel method Multigrid method Numerical method Partial differential equations Elliptic problem A parallel adaptive wavelet collocation method for solving a large class of Partial Differential Equations is presented. The parallelization is achieved by...
متن کامل